منابع مشابه
Some New Super-congruences modulo Prime Powers
Let p > 3 be a prime. We show that p−1 k=0 −1/(p + 1) k p+1 ≡ 0 (mod p 5) and p−1 k=0 1/(p − 1) k p−1 ≡ 0 (mod p 4). For any positive integer m ≡ 0 (mod p), we prove that p−1 k=0 (−1) km p/m − 1 k m ≡ 0 (mod p 4), and p−1 k=1 (−1) km k 2 p/m − 1 k m ≡ 1 p p−1 k=1 1 k (mod p 3) if p > 5. The paper also contains some open conjectures.
متن کاملComputing special powers in finite fields
We study exponentiation in nonprime finite fields with very special exponents such as they occur, for example, in inversion, primitivity tests, and polynomial factorization. Our algorithmic approach improves the corresponding exponentiation problem from about quadratic to about linear time.
متن کاملBioinspired super-antiwetting interfaces with special liquid-solid adhesion.
Super-antiwetting interfaces, such as superhydrophobic and superamphiphobic surfaces in air and superoleophobic interfaces in water, with special liquid-solid adhesion have recently attracted worldwide attention. Through tuning surface microstructures and compositions to achieve certain solid/liquid contact modes, we can effectively control the liquid-solid adhesion in a super-antiwetting state...
متن کاملSuper Calabi-Yau’s and Special Lagrangians
We apply mirror symmetry to the super Calabi-Yau manifold CP and show that the mirror can be recast in a form which depends only on the superdimension and which is reminiscent of a generalized conifold. We discuss its geometrical properties in comparison to the familiar conifold geometry. In the second part of the paper examples of special-Lagrangian submanifolds are constructed for a class of ...
متن کاملSuper-connectivity of Kronecker products of split graphs, powers of cycles, powers of paths and complete graphs
The Kronecker product of two connected graphs G1,G2, denoted by G1 × G2, is the graph with vertex set V (G1 ×G2) = V (G1)×V (G2) and edge set E(G1 ×G2) = {(u1, v1)(u2, v2) : u1u2 ∈ E(G1), v1v2 ∈ E(G2)}. The kth power Gk of G is the graph with vertex set V (G) such that two distinct vertices are adjacent in Gk if and only if their distance apart in G is at most k. A connected graph G is called s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2008
ISSN: 0028-0836,1476-4687
DOI: 10.1038/453455a